Fixed-Point Ellipse Drawing Algorithm
نویسندگان
چکیده
This algorithm draws ellipses with integer centres and decimal radii on discrete devices using fixed-point arithmetic. These ellipses have both X and Y axis parallel to the coordinate axes. It uses forward differences to diminish its cost. It has a low comp utational complexity while the error is lower than traditional algorithms. This algorithm works in the squared R space (fixed-point) and translates directly the decimal points to the Z natural screen space.
منابع مشابه
A Mid -point Ellipse Drawing Algorithm on a Hexagonal Grid
In this paper, the idea of Mid-point ellipse drawing algorithm on a hexagonal grid is proposed. The performance of the proposed algorithm is compared to that of the conventional ellipse drawing algorithm on a square grid. The qualitative and execution time analysis proves that the proposed algorithm performs better than the conventional ellipse drawing algorithm on a square grid.
متن کاملA New Look at the So-Called Trammel of Archimedes
1. INTRODUCTION. STANDARD TRAMMEL. Figure 1a shows a line segment of fixed length whose ends slide along two perpendicular axes. It can be realized physically as a sliding ladder or as a sliding door moving with its ends on two perpendicular tracks. During the motion, a fixed point on the segment traces an ellipse with one quarter of the ellipse in each quadrant (Figure 1b), so this device is c...
متن کاملCorrector-predictor arc-search interior-point algorithm for $P_*(kappa)$-LCP acting in a wide neighborhood of the central path
In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...
متن کاملGeometric Interpretation and Precision Analysis of Algebraic Ellipse Fitting Using Least Squares Method
This paper presents a new approach for precision estimation for algebraic ellipse fitting based on combined least squares method. Our approach is based on coordinate description of the ellipse geometry to determine the error distances of the fitting method. Since it is an effective fitting algorithm the well-known Direct Ellipse Fitting method was selected as an algebraic method for precision e...
متن کاملApproximate formulas for the Point-to-Ellipse and for the Point-to-Ellipsoid Distance Problem
We deduce some approximate formulas for the distance evaluation problem between a point and an ellipse in IR2 and a point and an ellipsoid in IR3. The proposed approach is based on the analytical representation of the distance function as a zero of an appropriate univariate algebraic equation. Key–Words: Distance, point-to-ellipse, point-to-ellipsoid
متن کامل